Precedence-constrained scheduling problems parameterized by partial order width

Negatively answering a question posed by Mnich and Wiese (Math. Program. 154(1-2):533-562), we show that P2|prec,$p_j{\in}\{1,2\}$|$C_{\max}$, the problem of finding a non-preemptive minimum-makespan schedule for precedence-constrained jobs of lengths 1 and 2 on two parallel identical machines, is W[2]-hard parameterized by the width of the partial order giving the precedence constraints. To this end, we show that Shuffle Product, the problem of deciding whether a given word can be obtained by interleaving the letters of $k$ other given words, is W[2]-hard parameterized by $k$, thus additionally answering a question posed by Rizzi and Vialette (CSR 2013). Finally, refining a geometric algorithm due to Servakh (Diskretn. Anal. Issled. Oper. 7(1):75-82), we show that the more general Resource-Constrained Project Scheduling problem is fixed-parameter tractable parameterized by the partial order width combined with the maximum allowed difference between the earliest possible and factual starting time of a job.Comment: 14 pages plus appendi

But Not Both:The Exclusive Disjunction in Qualitative Comparative Analysis (QCA)

The application of Boolean logic using Qualitative Comparative Analysis (QCA) is becoming more frequent in political science but is still in its relative infancy. Boolean ‘AND’ and ‘OR’ are used to express and simplify combinations of necessary and sufficient conditions. This paper draws out a distinction overlooked by the QCA literature: the difference between inclusive- and exclusive-or (OR and XOR). It demonstrates that many scholars who have used the Boolean OR in fact mean XOR, discusses the implications of this confusion and explains the applications of XOR to QCA. Although XOR can be expressed in terms of OR and AND, explicit use of XOR has several advantages: it mirrors natural language closely, extends our understanding of equifinality and deals with mutually exclusive clusters of sufficiency conditions. XOR deserves explicit treatment within QCA because it emphasizes precisely the values that make QCA attractive to political scientists: contextualization, confounding variables, and multiple and conjunctural causation

Ubiquitous molecular substrates for associative learning and activity-dependent neuronal facilitation.

Recent evidence suggests that many of the molecular cascades and substrates that contribute to learning-related forms of neuronal plasticity may be conserved across ostensibly disparate model systems. Notably, the facilitation of neuronal excitability and synaptic transmission that contribute to associative learning in Aplysia and Hermissenda, as well as associative LTP in hippocampal CA1 cells, all require (or are enhanced by) the convergence of a transient elevation in intracellular Ca2+ with transmitter binding to metabotropic cell-surface receptors. This temporal convergence of Ca2+ and G-protein-stimulated second-messenger cascades synergistically stimulates several classes of serine/threonine protein kinases, which in turn modulate receptor function or cell excitability through the phosphorylation of ion channels. We present a summary of the biophysical and molecular constituents of neuronal and synaptic facilitation in each of these three model systems. Although specific components of the underlying molecular cascades differ across these three systems, fundamental aspects of these cascades are widely conserved, leading to the conclusion that the conceptual semblance of these superficially disparate systems is far greater than is generally acknowledged. We suggest that the elucidation of mechanistic similarities between different systems will ultimately fulfill the goal of the model systems approach, that is, the description of critical and ubiquitous features of neuronal and synaptic events that contribute to memory induction

Decision support tool for dynamic scheduling

Production scheduling in the presence of real-time events is of great importance for the successful implementation of real-world scheduling systems. Most manufacturing systems operate in dynamic environments vulnerable to various stochastic real-time events which continuously forces reconsideration and revision of pre-established schedules. In an uncertain environment, efficient ways to adapt current solutions to unexpected events, are preferable to solutions that soon become obsolete. This reality motivated us to develop a tool that attempts to start filling the gap between scheduling theory and practice. The developed prototype is connected to the MRP software and uses meta heuristics to generate a predictive schedule. Then, whenever disruptions happen, like arrival of new tasks or cancelation of others, the tool starts rescheduling through a dynamic-event module that combines dispatching rules that best fit the performance measures pre-classified by Kano’s model. The proposed tool was tested in an in-depth computational study with dynamic task releases and stochastic execution time. The results demonstrate the effectiveness of the model.- (undefined